Geometric algorithms and combinatorial optimization
نویسندگان
چکیده
منابع مشابه
Eecient Algorithms for Geometric Optimization Eecient Algorithms for Geometric Optimization
Linear Programming 15 contain such a constraint), which implies that after kd iterations (H) (B) 2k. Hence, after kd successful rounds, 2k (H) nek=3. This implies that the above algorithm terminates in at most 3d lnn successful rounds. Since each round takes O(dd) time to compute xR and O(dn) time to compute V , the expected running time of the algorithm is O((d2n+dd+1) log n). By combining thi...
متن کاملSA 01 Geometric Optimization Sponsor : Optimization / Network and Combinatorial Optimization
Let P be a set of n points in d-dimensional Euclidean space. A (k,eps)-kernel is a subset of P that, for every direction, epsilon-approximates the directional width of P, when k “outliers’’ can be ignored in that direction. We prove that small (k,eps)-kernels exist and describe efficient algorithms for computing them. Such kernels are instrumental in solving shape-fitting problems with k outlie...
متن کاملConsidering Stochastic and Combinatorial Optimization
Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...
متن کاملApproximation Algorithms for Combinatorial Optimization
In combinatorial optimization, the most important challenges are presented by problems belonging to the class NP-hard. For such problems no algorithm is known that can solve all instances in polynomial time. It is also strongly believed that no polynomial algorithm is capable of doing this. Although it is very difficult to solve exactly any of the NP-hard problems, some of them are amenable to ...
متن کاملCombinatorial Optimization Algorithms via Polymorphisms
An elegant characterization of the complexity of constraint satisfaction problems has emerged in the form of the the algebraic dichotomy conjecture of [BKJ00]. Roughly speaking, the characterization asserts that a CSP Λ is tractable if and only if there exist certain non-trivial operations known as polymorphisms to combine solutions to Λ to create new ones. In an entirely separate line of work,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1990
ISSN: 0001-8708
DOI: 10.1016/0001-8708(90)90093-3